#include "avl_tree.hpp"

int main() {
    Node* root = nullptr;
    // 在这里进行插入操作，例如：
    root = insertNode(root, 10);
    root = insertNode(root, 20);
    root = insertNode(root, 30);
    root = insertNode(root, 40);
    root = insertNode(root, 50);
    root = insertNode(root, 25);
    // 输出中序遍历结果
    inorderTraversal(root);

    // 测试查找功能
    int keyToSearch = 30;
    auto searchTime = measureTime(searchNode, root, keyToSearch);
    std::cout << "\nSearching for key " << keyToSearch << " took " << searchTime << " ms." << std::endl;

    return 0;
}
